A study of search neighbourhood in the bees algorithm

نویسنده

  • Siti Ahmad
چکیده

ambiguous and subjective (Ang et al., 2010). Over the years, the classical TRIZ has been studied and extended to embrace broader features and inventive principles. This study led to the development of a new TRIZ matrix, which contained up to 48 features, with 77 inventive principles (Mann et al., 2003). Several years later, the study of TRIZ had brought to another matrix, which comprised 50 features, with 82 solutions (Mann 2009). The increasing number of features and inventive solutions did not necessarily guarantee a solution to a problem. On the other hand, it did minimise the number of trials and error of the solution finding process (Duran-Novoa et al., 2011). Considering the problem from a different perspective might also derive a system in different and stronger ways. Furthermore, the higher the level of the disagreement, the more obvious it would be and become easier to remove it

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

Constrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm

Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...

متن کامل

New Technique for Global Solar Radiation Forecast using Bees Algorithm (RESEARCH NOTE)

Estimation of solar radiation is the most important parameter for various solar energy systems. Expensive devices are required to achieve the amount of solar radiation for a special region, therefore different models have been proposed by researchers to estimate the solar radiation that obviate using such devices. Nonlinear nature and excessive dependence on the meteorological parameters of the...

متن کامل

The Bees Algorithm – A Novel Tool for Complex Optimisation Problems

A new population-based search algorithm called the Bees Algorithm (BA) is presented. The algorithm mimics the food foraging behaviour of swarms of honey bees. In its basic version, the algorithm performs a kind of neighbourhood search combined with random search and can be used for both combinatorial optimisation and functional optimisation. This paper focuses on the latter. Following a descrip...

متن کامل

Constrained Nonlinear Optimal Control via a Hybrid BA-SD

The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012